A Majorized Penalty Approach for Calibrating Rank Constrained Correlation Matrix Problems
نویسندگان
چکیده
In this paper, we aim at finding a nearest correlation matrix to a given symmetric matrix, measured by the componentwise weighted Frobenius norm, with a prescribed rank and bound constraints on its correlations. This is in general a non-convex and difficult problem due to the presence of the rank constraint. To deal with this difficulty, we first consider a penalized version of this problem and then apply the essential ideas of the majorization method to the penalized problem by solving iteratively a sequence of least squares correlation matrix problems without the rank constraint. The latter problems can be solved by a recently developed quadratically convergent smoothing Newton-BiCGStab method. Numerical examples demonstrate that our approach is very efficient for obtaining a nearest correlation matrix with both rank and bound constraints.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملAdaptive Penalty Function for Solving Constrained Evolutionary Optimization
A criticism of Evolutionary Algorithms might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search problems is to use penalty methods, because of their simplicity and ease of implementation. The penalty function approach is generic and applicable to any type of constraint (linear or nonlinear). Nonetheless, the most diffic...
متن کاملError bounds for rank constrained optimization problems
This paper is concerned with the rank constrained optimization problem whose feasible set is the intersection of the rank constraint set R = { X ∈ X | rank(X) ≤ κ } and a closed convex set Ω. We establish the local (global) Lipschitzian type error bounds for estimating the distance from any X ∈ Ω (X ∈ X) to the feasible set and the solution set, respectively, under the calmness of a multifuncti...
متن کاملA Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
We present a line search algorithm for large-scale equality constrained optimization designed primarily for problems with (near) rank-deficient Jacobian matrices. The method is matrixfree (i.e., it does not require explicit representations or factorizations of derivative matrices), allows for inexact step computations, and does not require inertia information in order to solve nonconvex problem...
متن کامل